Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
نویسندگان
چکیده
منابع مشابه
Multi-Criteria Traveling Salesman Problems
In multi-criteria optimization problems, several objective functions have to be optimized. Since the different objective functions are usually in conflict with each other, one cannot consider only one particular solution as the optimal solution. Instead, the aim is to compute a so-called Pareto curve of solutions. Since Pareto curves cannot be computed efficiently in general, we have to be cont...
متن کامل1 2 O ct 2 00 6 Approximation Algorithms for Multi - criteria Traveling Salesman Problems ∗
In multi-criteria optimization problems, several objective functions have to be optimized. Since the different objective functions are usually in conflict with each other, one cannot consider only one particular solution as the optimal solution. Instead, the aim is to compute a so-called Pareto curve of solutions. Since Pareto curves cannot be computed efficiently in general, we have to be cont...
متن کاملNew Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
متن کاملLP-Based Approximation Algorithms for Traveling Salesman Path Problems
We present a ( 3 − ǫ)-approximation algorithm for some constant ǫ > 0 for the traveling salesman path problem under the unit-weight graphical metric, and prove an upper bound on the integrality gap of the path-variant Held-Karp relaxation both under this metric and the general metric. Given a complete graph with the metric cost and two designated endpoints in the graph, the traveling salesman p...
متن کاملApproximation algorithms for the traveling salesman problem
We first prove that the minimum and maximum traveling salesman problems, their metric versions as well as some versions defined on parameterized triangle inequalities (called sharpened and relaxed metric traveling salesman) are all equi-approximable under an approximation measure, called differential-approximation ratio, that measures how the value of an approximate solution is placed in the in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2007
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-007-9011-z